Revealing Subgroup Structure in Ranked Data Using a Bayesian WAND

Bayesian nonparametric models for ranked data

We develop a Bayesian nonparametric extension of the popular Plackett-Luce choice model that can handle an infinite number of choice items. Our framework is based on the theory of random atomic measures, with the prior specified by a gamma process. We derive a posterior characterization and a simple and effective Gibbs sampler for posterior simulation. We develop a time-varying extension of our...

pattern recognition in maintenance data using methodologies data minitng (cade study isfahan regional power electric company)

فعالیت های نگهداری و تعمیرات اطلاعاتی را تولید می کند که می تواند در تعیین زمان های بیکاری و ارایه یک برنامه زمان بندی شده یا تعیین هشدارهای خرابی به پرسنل نگهداری و تعمیرات کمک کند. وقتی که مقدار داده های تولید شده زیاد باشند، فهم بین متغیرها بسیار مشکل می شوند. این پایان نامه به کاربردی از داده کاوی برای کاوش پایگاه های داده چندبعدی در حوزه نگهداری و تعمیرات، برای پیدا کردن خرابی هایی که موجب...

 Structure Learning in Bayesian Networks Using Asexual Reproduction Optimization

A new structure learning approach for Bayesian networks (BNs) based on asexual reproduction optimization (ARO) is proposed in this letter. ARO can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survi...

Learning Bayesian Network Structure using Markov Blanket in K2 Algorithm

‎A Bayesian network is a graphical model that represents a set of random variables and their causal relationship via a Directed Acyclic Graph (DAG)‎. ‎There are basically two methods used for learning Bayesian network‎: ‎parameter-learning and structure-learning‎. ‎One of the most effective structure-learning methods is K2 algorithm‎. ‎Because the performance of the K2 algorithm depends on node...

Understanding the Structure of Ranked Data